Labelled Sequent Calculi and Completeness Theorems for Implicational Relevant Logics
نویسنده
چکیده
It is known that the implicational fragment of the relevant logic E is complete with respect to the class of Urquhart's models, where a model consists of a semilattice and a set of possible worlds. This paper shows that some implicational relevant logics, which are obtained from E by adding axioms, are complete with respect to the class of Urquhart's models with certain conditions. To show this, we introduce labelled sequent calculi.
منابع مشابه
Systematic Construction of Natural Deduction Systems for Many-Valued Logics
A construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent calculi, which in turn can be automatically extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness and norm...
متن کاملSystematic Construction of Natural Deduction Systems for Many-valued Logics: Extended Report
We exhibit a construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics. These systems are systematically obtained from sequent calculi, which in turn can be extracted from the truth tables of the logics under consideration. Soundness and cut-free completeness of these sequent calculi translate into soundness, completeness and normal form theorems...
متن کاملSequent Calculi for the classical fragment of Bochvar and Halldén's Nonsense Logics
In this paper sequent calculi for the classical fragment (that is, the conjunction-disjunction-implication-negation fragment) of the nonsense logics B3, introduced by Bochvar, and H3, introduced by Halldén, are presented. These calculi are obtained by restricting in an appropriate way the application of the rules of a sequent calculus for classical propositional logic CPL. The nice symmetry bet...
متن کاملar X iv : 1 30 7 . 55 92 v 4 [ cs . L O ] 2 6 N ov 2 01 3 Proof Search for Propositional Abstract Separation Logics via Labelled Sequents
Abstract separation logics are a family of extensions of Hoare logic for reasoning about programs that mutate memory. These logics are “abstract” because they are independent of any particular concrete memory model. Their assertion languages, called propositional abstract separation logics, extend the logic of (Boolean) Bunched Implications (BBI) in various ways. We develop a modular proof theo...
متن کاملTree-Sequent Methods for Subintuitionistic Predicate Logics
Subintuitionistic logics are a class of logics defined by using Kripke models with more general conditions than those for intuitionistic logic. In this paper we study predicate logics of this kind by the method of tree-sequent calculus (a special form of Labelled Deductive System). After proving the completeness with respect to some classes of Kripke models, we introduce Hilbert-style axiom sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999